Bounding the clique-width of H-free split graphs
نویسندگان
چکیده
منابع مشابه
Bounding the Clique-Width of H-free Split Graphs
A graph is H-free if it has no induced subgraph isomorphic to H . We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of H-free split graphs whose clique-width is bounded. Our main result, obtained by combining new and known results, provides a classification of all but two stubborn cases, that is, with two potential exceptions ...
متن کاملBounding the Clique-Width of H-free Chordal Graphs
A graph is H-free if it has no induced subgraph isomorphic to H . Brandstädt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandstädt, Le and Mosca erroneously claimed that the gem and the co-gem are the only two 1-vertex P4-extensions H for which the class of H-free chordal graphs has bounded clique-width. In fa...
متن کاملBounding Clique-Width via Perfect Graphs
Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no subgraph isomorphic to H1 or H2. We continue a recent study into the clique-width of (H1,H2)-free graphs and present three new classes of (H1, H2)-free graphs that have bounded clique-width. We also show the implications of our results for the computational complexity of the Colouring problem restricted to (H1,H2)-free grap...
متن کاملClassifying the Clique-Width of H-Free Bipartite Graphs
Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (BH ,WH). We consider three different, natural ways of forbidding H as an induced subgraph in G. First, G is H-free if it does not contain H as an induced subgraph. Second, G is strongly H-free if G is H-free or else has no bipartition (BG,WG) with BH ⊆ BG and WH ⊆ WG. Third, G is weakly H-free if G is H-free or...
متن کاملGem- And Co-Gem-Free Graphs Have Bounded Clique-Width
The P4 is the induced path of four vertices. The gem consists of a P4 with an additional universal vertex being completely adjacent to the P4, and the co-gem is its complement graph. Gemand co-gem-free graphs generalize the popular class of cographs (i. e. P4-free graphs). The tree structure and algebraic generation of cographs has been crucial for several concepts of graph decomposition such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.04.003